Free Algebras for Gödel-Löb Provability Logic
نویسنده
چکیده
We give a construction of finitely generated free algebras for Gödel-Löb provability logic, GL. On the semantic side, this construction yields a notion of canonical graded model for GL and a syntactic definition of those normal forms which are consistent with GL. Our two main techniques are incremental constructions of free algebras and finite duality for partial modal algebras. In order to apply these techniques to GL, we use a rule-based formulation of the logic GL by Avron (which we simplify slightly), and the corresponding semantic characterization that was recently obtained by Bezhanishvili and Ghilardi.
منابع مشابه
Constructive Provability Logic 1
We present two variants of an intuitionistic sequent calculus that validates the Löb rule and permits logical reflection over provability. We explore properties of both variants of this logic, which we call constructive provability logic due to its close ties to Gödel-Löb provability logic.
متن کاملProject Report Logic Programming in Constructive Provability Logic 15-816 Modal Logic
We present a novel formulation of CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We use this logic as a basis for a discussion of negation in logic programming.
متن کاملCircular Proofs for Gödel-Löb Logic
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish Lindon interpolation for GL syntactically.
متن کاملNotes on Provability Logic
This notes provides a brief survey that reflects the early development of provability logic. It includes a detailed exposition of Gödel’s incompleteness results, the Löb theorem, and the arithmetical completeness theorems of Solovay.
متن کاملA Solovay Function for the Least 1-inconsistent Subtheory of Pa
We consider the theory IΣμ, where μ is the least x such that IΣx together with all true Π1-sentences is inconsistent. We show that the provability logic of IΣμ coincides with that of PA, i.e. the Gödel–Löb provability logic GL. While arithmetical completeness of GL with respect to PA is established by using a single Solovay function, our proof for IΣμ relies on a uniformly defined infinite sequ...
متن کامل